Border Samples Detection for Data Mining Applications Using Non Convex Hulls

نویسندگان

  • Asdrúbal López Chau
  • Xiaoou Li
  • Wen Yu
  • Jair Cervantes
  • Pedro Mejía-Alvarez
چکیده

Border points are those instances located at the outer margin of dense clusters of samples. The detection is important in many areas such as data mining, image processing, robotics, geographic information systems and pattern recognition. In this paper we propose a novel method to detect border samples. The proposed method makes use of a discretization and works on partitions of the set of points. Then the border samples are detected by applying an algorithm similar to the presented in reference [8] on the sides of convex hulls. We apply the novel algorithm on classification task of data mining; experimental results show the effectiveness of our method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partially Supervised Anomaly Detection Using Convex Hulls on a 2D Parameter Space

Anomaly detection is the problem of identifying objects appearing to be inconstistent with the remainder of that set of data. Detecting such samples is useful on various applications such as fault detection, fraud detection and diagnostic systems. Partially supervised methods for anomaly detection are interesting because they only need data labeled as one of the classes (normal or abnormal). In...

متن کامل

DataGrinder: Fast, Accurate, Fully non-Parametric Classification Approach Using 2D Convex Hulls

It has been a long time, since data mining technologies have made their ways to the field of data management. Classification is one of the most important data mining tasks for label prediction, categorization of objects into groups, advertisement and data management. In this paper, we focus on the standard classification problem which is predicting unknown labels in Euclidean space. Most effort...

متن کامل

A Geometric Framework for Detection of Critical Points in a Trajectory Using Convex Hulls

Large volumes of trajectory-based data require development of appropriate data manipulation mechanisms that will offer efficient computational solutions. In particular, identification of meaningful geometric points of such trajectories is still an open research issue. Detection of these critical points implies to identify self-intersecting, turning and curvature points so that specific geometri...

متن کامل

Collision Detection Using Bounding Boxes: Convexity Helps

We consider the use of bounding boxes to detect collisions among a set of convex objects in R d. We derive tight bounds on the ratio between the number of box intersections and the number of object intersections. Connrming intuition, we show that the performance of bounding boxes improves signiicantly when the underlying objects are all convex. In particular, the ratio is (1?1=d 1=2 box) if eac...

متن کامل

Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature

Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many properties of convex hulls in Euclidean space fail to transfer over. We give examples of some such properties. For 2-dimensional CAT(0) polyhedral complexes, we gi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011